Characteristic Polynomial

نویسنده

  • Massoud Malek
چکیده

A [ An−1 + p1A n−2 + · · ·+ pn−1 In ] = −pn In . Since A is nonsingular, pn = (−1)n det(A) 6= 0; thus the result follows. Newton’s Identity. Let λ1, λ2, . . . , λn be the roots of the polynomial K(λ) = λ + p1λ n−1 + p2λ n−2 + · · · · · ·+ pn−1λ+ pn. If sk = λ k 1 + λ k 2 + · · ·+ λn, then pk = − 1 k (sk + sk−1 p1 + sk−2 p2 + · · ·+ s2 pk−2p1 + s1 pk−1) . Proof. From K(λ) = (λ − λ1)(λ − λ2) . . . . . . (λ − λn−1)(λ − λn) and the use of logarithmic differentiation, we obtain

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications

ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...

متن کامل

SIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL

Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients of their signed characteristic polynomial and signed Laplacian characteristic polynomial are calculated.

متن کامل

Determination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial

Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...

متن کامل

EFFECT OF LOCATION OF EXPLANATORY VARIABLE ON MONITORING POLYNOMIAL QUALITY PROFILES

The quality is typically modeled as the univariate or multivariate distribution of quality characteristic/s. In recent applications of statistical process control, quality profiles in which the relationship between a response and explanatory variable/s is captured and monitored are increasingly used to model the quality. Several techniques have been developed to enhance the speed of detecting c...

متن کامل

Monodromy problem for the degenerate critical points

For the polynomial planar vector fields with a hyperbolic or nilpotent critical point at the origin, the monodromy problem has been solved, but for the strongly degenerate critical points this problem is still open. When the critical point is monodromic, the stability problem or the center- focus problem is an open problem too. In this paper we will consider the polynomial planar vector fields ...

متن کامل

The Laplacian Polynomial and Kirchhoff Index of the k-th‎ Semi Total Point Graphs

The k-th semi total point graph of a graph G, , ‎is a graph‎ obtained from G by adding k vertices corresponding to each edge and‎ connecting them to the endpoints of edge considered‎. ‎In this paper‎, a formula for Laplacian polynomial of in terms of‎ characteristic and Laplacian polynomials of G is computed‎, ‎where is a connected regular graph‎.The Kirchhoff index of is also computed‎.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016